Overview of Convex Optimization

Convex optimization focuses on a subset of optimization problems, i.e., the objectives and constraints are convex, which means \( f(ax+by) \le a f(x) + b f(y) \).